Resistance of Random Walks
نویسندگان
چکیده
Unrestricted lattice random walks in which a unit conductor is placed along each bond traversed are considered. The mean end-to-end resistance is studied as a function of the number of steps in the walk and the spatial dimension. A critical scaling law is found whose exponent is consistently given by four different calculational schemes.
منابع مشابه
A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملThe Type Problem: Effective Resistance and Random Walks on Graphs
The question of recurrence or transience – the so-called type problem – is a central one in the theory of random walks. We consider edgeweighted random walks on locally finite graphs. The effective resistance of such weighted graphs is defined electrically and shown to be infinite if and only if the weighted graph is recurrent. We then introduce the Moore-Penrose pseudoinverse of the Laplacian ...
متن کاملRandom Walks and Chemical Graph Theory
Simple random walks probabilistically grown step by step on a graph are distinguished from walk enumerations and associated equipoise random walks. Substructure characteristics and graph invariants correspondingly defined for the two types of random walks are then also distinct, though there often are analogous relations. It is noted that the connectivity index as well as some resistance-distan...
متن کاملElectric Networks and Commute Time
The equivalence of random walks on weighted graphs with reversible Markov chains has long been known. Another such correspondence exists between electric networks and these random walks. Results in the language of random walks have analogues in the language of electric networks and visa versa. We outline this correspondence and describe how to translate several of the major terms of electric ne...
متن کاملMean first-passage time for random walks on the T-graph
For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this paper, we study the MFPT of random walks using the famous T-graph, linking this important quantity to the resistance distance in electronic networks. We obtain an exact formula for the MFPT that is confirmed by extensi...
متن کامل